Optimal time reversal of multiphase equatorial states
نویسندگان
چکیده
منابع مشابه
Midday reversal of equatorial ionospheric electric ®eld
A comparative study of the geomagnetic and ionospheric data at equatorial and low-latitude stations in India over the 20 year period 1956±1975 is described. The reversal of the electric ®eld in the ionosphere over the magnetic equator during the midday hours indicated by the disappearance of the equatorial sporadic E region echoes on the ionograms is a rare phenomenon occurring on about 1% of t...
متن کاملOptimal Measurements, Time-reversal, and Automatic Frequencytuning
1 ABSTRACT In problems in which one wants to use electromagnetic waves to make an image of a small, weak scatterer, the question arises of which incident field will produce the scattered field with greatest energy. This problem can be solved by means of a certain adaptive algorithm that involves an iterative time-reversal process. The resulting best incident field is a time-harmonic (CW) wave, ...
متن کاملDensities of states, moments, and maximally broken time-reversal symmetry
Power moments, modified moments, and optimized moments are powerful tools for solving microscopic models of macroscopic systems; however, the expansion of the density of states as a continued fraction does not converge to the macroscopic limit point-wise in energy with increasing numbers of moments. In this work the moment problem is further constrained by minimal lifetimes or maximal breaking ...
متن کاملOptimal program execution reversal
For adjoint calculations, debugging, and similar purposes one may need to reverse the execution of a computer program. The simplest option of recording a complete execution log and then reading it backwards requires massive amounts of storage. Instead one may generate the execution log piecewise by restarting the “forward” calculation repeatedly from suitably placed checkpoints. Our goal is to ...
متن کاملOn Optimal DAG Reversal
Runs of numerical computer programs can be visualized as directed acyclic graphs (DAGs). We consider the problem of restoring the intermediate values computed by such a program (the vertices in the DAG) in reverse order for a given upper bound on the available memory. The minimization of the associated computational cost in terms of the number of performed arithmetic operations is shown to be N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2005
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.72.062311